509 research outputs found
TOWARDS A UNIFIED VIEW OF METAHEURISTICS
This talk provides a complete background on metaheuristics and presents in a unified view the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code. The key search components of metaheuristics are considered as a toolbox for:
- Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems.
- Designing efficient metaheuristics for multi-objective optimization problems.
- Designing hybrid, parallel and distributed metaheuristics.
- Implementing metaheuristics on sequential and parallel machines
TOWARDS A UNIFIED VIEW OF METAHEURISTICS
This talk provides a complete background on metaheuristics and presents in a unified view the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code. The key search components of metaheuristics are considered as a toolbox for:
- Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems.
- Designing efficient metaheuristics for multi-objective optimization problems.
- Designing hybrid, parallel and distributed metaheuristics.
- Implementing metaheuristics on sequential and parallel machines
A Note on Node Coloring in the SINR Model
A -coloring of a graph is a coloring of the nodes of with colors in such a way any two neighboring nodes have different colors. We prove that there exists a time distributed algorithm computing a -colroing for unit disc graphs under the signal-to-interference-plus-noise ratio (SINR)-based physical model ( is the maximum degree of the graph). We also show that, for a well defined constant , a -hop -coloring allows us to schedule an interference free MAC protocol under the physical SINR constraints. For instance this allows us to prove that any point-to-point message passing algorithm with running time can be simulated in the SINR model in time using messages of well chosen size. All our algorithms are proved to be correct with high probability
A Note on Node Coloring in the SINR Model
A -coloring of a graph is a coloring of the nodes of with colors in such a way any two neighboring nodes have different colors. We prove that there exists a time distributed algorithm computing a -colroing for unit disc graphs under the signal-to-interference-plus-noise ratio (SINR)-based physical model ( is the maximum degree of the graph). We also show that, for a well defined constant , a -hop -coloring allows us to schedule an interference free MAC protocol under the physical SINR constraints. For instance this allows us to prove that any point-to-point message passing algorithm with running time can be simulated in the SINR model in time using messages of well chosen size. All our algorithms are proved to be correct with high probability
Radio Network Distributed Algorithms in the Unknown Neighborhood Model
The paper deals with radio network distributed algorithms where nodes are not aware of their one hop neighborhood. Given an n-node graph modeling a multihop network of radio devices, we give a O(log^2 n) time distributed algorithm that computes w.h.p., a constant approximation value of the degree of each node. We also provide a O( \Delta log n + log^2 n) time distributed algorithm that computes w.h.p., a constant approximation value of the local maximum degree of each node, where the global maximum degree \Delta of the graph is not known. Using our algorithms as a plug-and-play procedure, we show that many existing distributed algorithms requiring the knowledge of to execute efficiently can be run with essentially the same time complexity by using the local maximum degree instead of . In other words, using the local maximum degree is sufficient to break the symmetry in a local and efficient manner. We illustrate this claim by investigating the complexity of some basic problems. First, we investigate the generic problem of simulating any classical message passing algorithm in the radio network model. Then, we study the fundamental edge/node coloring problem in the special case of unit disk graphs. The obtained results show that knowing the local maximum degree allows to coordinate the nodes locally and avoid interferences in radio networks
Machine learning into metaheuristics: A survey and taxonomy of data-driven metaheuristics
During the last years, research in applying machine learning (ML) to design efficient, effective and robust metaheuristics became increasingly popular. Many of those data driven metaheuristics have generated high quality results and represent state-of-the-art optimization algorithms. Although various appproaches have been proposed, there is a lack of a comprehensive survey and taxonomy on this research topic. In this paper we will investigate different opportunities for using ML into metaheuristics. We define uniformly the various ways synergies which might be achieved. A detailed taxonomy is proposed according to the concerned search component: target optimization problem, low-level and high-level components of metaheuristics. Our goal is also to motivate researchers in optimization to include ideas from ML into metaheuristics. We identify some open research issues in this topic which needs further in-depth investigations
Protein Sequencing with an Adaptive Genetic Algorithm from Tandem Mass Spectrometry
In Proteomics, only the de novo peptide sequencing approach allows a partial
amino acid sequence of a peptide to be found from a MS/MS spectrum. In this
article a preliminary work is presented to discover a complete protein sequence
from spectral data (MS and MS/MS spectra). For the moment, our approach only
uses MS spectra. A Genetic Algorithm (GA) has been designed with a new
evaluation function which works directly with a complete MS spectrum as input
and not with a mass list like the other methods using this kind of data. Thus
the mono isotopic peak extraction step which needs a human intervention is
deleted. The goal of this approach is to discover the sequence of unknown
proteins and to allow a better understanding of the differences between
experimental proteins and proteins from databases
- …